Partial Order Backtracking Based Job Shop Rescheduling
نویسندگان
چکیده
We present here a discipline for job shop rescheduling based on partial order backtracking. We show that partial order backtracking ooers the rescheduler a framework for schedule repair, based upon a set of nogoods, which impose a systematic partial order on the set of activities to be repaired but allows non systematic techniques to be used within that framework. We present rescheduling as partial order backtracking by explaining the need for rescheduling, describing our framework (using a generic example), and discussing the particular implementation problems associated with repairing job-shop schedules which consist of multi domain types.
منابع مشابه
A Discipline for Reactive Rescheduling
We present here a discipline for job shop reschedub ing based on partial order backtracking. We show that partial order backtracking offers the rescheduler a framework for schedule repair, based upon a set of nocdoods, which impose a systematic paxtial order on the set of activities to be repaired but allows non systematic techniques to be used within that framework. We present rescheduling as ...
متن کاملPredictive/reactive Scheduling with Uncertain Disruptions
In most real production environment, schedules are usually inevitable with the presence of a variety of unexpected disruptions. Thus it is necessary to develop predictive/reactive schedules which can absorb disruptions while maintaining high shop performance. In this paper, a robust predictive/reactive scheduling method is developed for solving job shop scheduling in dynamic environment. It con...
متن کاملIntelligent Backtracking Techniques for Job Shop Scheduling
This paper studies a version of the job shop scheduling problem in which some operations have to be scheduled within non-relaxable time windows (i.e. earliest/latest possible start time windows). This problem is a wellknown NP-complete Constraint Satisfaction Problem (CSP). A popular method for solving these types of problems consists in using depthrst backtrack search. Our earlier work focused...
متن کاملBacktracking Techniques for the Job Shop Scheduling Constraint Satisfaction Problem
This paper studies a version of the job shop scheduling problem in which some operations have to be scheduled within non-relaxable time windows (i.e. earliest/latest possible start time windows). This problem is a well-known NP-complete Constraint Satisfaction Problem (CSP). A popular method for solving this type of problems involves using depth-first backtrack search. In our earlier work, we f...
متن کاملA Genetic Regulatory Network-Based Method for Dynamic Hybrid Flow Shop Scheduling with Uncertain Processing Times
The hybrid flow shop is a typical discrete manufacturing system. A novel method is proposed to solve the shop scheduling problem featured with uncertain processing times. The rolling horizon strategy is adopted to evaluate the difference between a predictive plan and the actual production process in terms of job delivery time. The genetic regulatory network-based rescheduling algorithm revises ...
متن کامل